Transient characteristics of Gaussian queues
نویسندگان
چکیده
This paper analyzes transient characteristics of Gaussian queues. More specifically, we determine the logarithmic asymptotics of P(Q0 > pB,QTB > qB), where Qt denotes the workload at time t . For any pair (p, q), three regimes can be distinguished: (A) For small values of T , one of the events {Q0 > pB} and {QTB > qB} will essentially imply the other. (B) Then there is an intermediate range of values of T for which it is to be expected that both {Q0 > pB} and {QTB > qB} are tight (in that none of them essentially implies the other), but that the time epochs 0 and T lie in the same busy period with overwhelming probability. (C) Finally, for large T , still both events are tight, but now they occur in different busy periods with overwhelming probability. For the short-range dependent case, explicit calculaK. Dȩbicki was partially supported by MNiSW Grant No. N N2014079 33 (2007–2009) and by a Marie Curie Transfer of Knowledge Fellowship of the European Community’s Sixth Framework Programme under Contract MTKD-CT-2004-013389. Part of this work was done while M. Mandjes was at Stanford University, Stanford, CA 94305, US. K. Dȩbicki Instytut Matematyczny, University of Wrocław, pl. Grunwaldzki 2/4, 50-384 Wrocław, Poland e-mail: [email protected] A. Es-Saghouani · M. Mandjes ( ) Korteweg-de Vries Institute for Mathematics, Plantage Muidergracht 24, 1018 TV Amsterdam, The Netherlands e-mail: [email protected] A. Es-Saghouani e-mail: [email protected] M. Mandjes CWI, Amsterdam, The Netherlands M. Mandjes EURANDOM, Eindhoven, The Netherlands 384 Queueing Syst (2009) 62: 383–409 tions are presented, whereas for the long-range dependent case, structural results are proven.
منابع مشابه
Dynamics of social queues.
Queues formed by social wasps to inherit the dominant position in the nest are analyzed by using a transient quasi-birth-and-death (QBD) process. We show that the extended nest lifespan due to division of labor between queen and helpers has a big impact on nest productivity.
متن کاملA New View of the Heavy-Traffic Limit Theorem for Infinite-Server Queues
This paper presents a new approach for obtaining heavy-traffic limits for infinite-server queues and open networks of infinite-server queues. The key observation is that infinite-server queues having deterministic service times can easily be analyzed in terms of the arrival counting process. A variant of the same idea applies when the service times take values in a finite set, so this is the ke...
متن کاملApproximate Transient Analysis of Queuing Networks by Decomposition based on Time-Inhomogeneous Markov Arrival Processes
We address the transient analysis of networks of queues with exponential service times. Such networks can easily have such a huge state space that their exact transient analysis is unfeasible. In this paper we propose an approximate transient analysis technique based on decomposing the queues of the network using a compact and approximate representation of the departure process of each queue. N...
متن کاملA Unified Method of Analysis for Queues with Markovian Arrivals
We deal with finite-buffer queueing systems fed by a Markovian point process. This class includes the queues of type M/G/1/N, M/G/1/N, PH/G/1/N, MMPP/G/1/N, MAP/G/1/N, and BMAP/G/1/N and is commonly used in the performance evaluation of network traffic buffering processes. Typically, such queueing systems are studied in the stationary regime using matrixanalytic methods connected with M/G/1-typ...
متن کاملSOME GENERALIZATIONS OF WEAK CONVERGENCE RESULTS ON MULTIPLE CHANNEL QUEUES IN HEAVY TRAFFIC.
This paper extends certain results of Iglehart and Whitt on multiple channel queues to the case where the inter-arrival times and service times are not necessarily identically distributed. It is shown that the weak convergence results in this case are exactly the same as those obtained by Iglehart and Whitt
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Queueing Syst.
دوره 62 شماره
صفحات -
تاریخ انتشار 2009